Gosper’s Algorithm and Accurate Summation as Definite Summation Tools
نویسندگان
چکیده
Sufficient conditions are given for validity of the discrete Newton-Leibniz formula when the indefinite sum is obtained either by Gosper’s algorithm or by Accurate Summation algorithm. It is shown that sometimes a polynomial can be factored from the summand in such a way that the safe summation range is inreased.
منابع مشابه
Symbolic Summation | Some Recent Developments
In recent years, the problem of symbolic summation has received much attention due to the exciting applications of Zeilberger’s method for definite hypergeometric summation. This lead to renewed interest in the central part of the algorithmic machinery, Gosper’s “classical” method for indefinite hypergeometric summation. We review some of the recent (partly unpublished as yet) work done in this...
متن کاملImprovement of the Degree Setting in Gospers's Algorithm
Gosper’s algorithm for indefinite hypergeometric summation (see Gosper (1978), Lafon (1983) or Graham, Knuth and Patashnik (1989)) belongs to the standard methods implemented in most computer algebra systems. Current interest in this algorithm is mainly due to the fact that it can also be used for definite hypergeometric summation (e.g. verifying binomial identities “automatically”, finding rec...
متن کاملAnalytic Solutions of Linear Difference Equations, Formal Series, and Bottom Summation
We consider summation of consecutive values φ(v), φ(v+1), . . . , φ(w) of a meromorphic function φ(z) where v, w ∈ ZZ. We assume that φ(z) satisfies a linear difference equation L(y) = 0 with polynomial coefficients, and that a summing operator for L exists (such an operator can be found – if it exists – by the Accurate Summation algorithm, or alternatively, by Gosper’s algorithm when ordL = 1)...
متن کاملA Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities
Gosper’s algorithm for indefinite hypergeometric summation, see e.g. Gosper (1978) or Lafon (1983) or Graham, Knuth and Patashnik (1989), belongs to the standard methods implemented in most computer algebra systems. Exceptions are, for instance, the 2.xVersions of the Mathematica system where symbolic summation is done by different means. A brief discussion is given in section 5. Current intere...
متن کاملA Generalization of Gosper's Algorithm to Bibasic Hypergeometric Summation
An algebraically motivated generalization of Gosper’s algorithm to indefinite bibasic hypergeometric summation is presented. In particular, it is shown how Paule’s concept of greatest factorial factorization of polynomials can be extended to the bibasic case. It turns out that most of the bibasic hypergeometric summation identities from literature can be proved and even found this way. A Mathem...
متن کامل